Transforming range queries to equivalent box queries to optimize page access
نویسندگان
چکیده
منابع مشابه
Transforming Range Queries To Equivalent Box Queries To Optimize Page Access
Range queries based on L1 distance are a common type of queries in multimedia databases containing feature vectors. We propose a novel approach that transforms the feature space into a new feature space such that range queries in the original space are mapped into equivalent box queries in the transformed space. Since box queries are axes aligned, there are several implementational advantages t...
متن کاملPushing extrema aggregates to optimize logic queries
In this paper, we explore the possibility of transforming queries with minimum and maximum predicates into equivalent queries that can be computed more efficiently. The main contribution of the paper is an algorithm for propagating min and max predicates while preserving query equivalence under certain monotonicity constraints. We show that the algorithm is correct and that the transformed quer...
متن کاملDesigning Views to Optimize Real Queries
This paper considers the following problem: given a query workload, a database, and a set of constraints, design a set of views that give equivalent rewritings of the workload queries and globally minimize the evaluation costs of the workload on the database under the constraints. We refer to this problem as “view design for query performance,” or “view design” for short; sets of views that sat...
متن کاملInferring Function Semantics to Optimize Queries
The goal of the COKO-KOLA project [10, 9] is to express rules of rule-based optimizers in a manner permitting verification with a theorem prover. In [10], we considered query transformations that were too general to be expressed with rewrite rules. In this paper, we consider the complementary issue of expressing query transformations that are too specifc for rewrite rules. Such transformations ...
متن کاملTuning Access Methods to Supporting Data-intensive Queries Tuning Access Methods to Supporting Data-intensive Queries
In this paper, we consider how to improve dynamic access methods which are designed to perform data-intensive selection queries in a dynamic setting. A large number of dynamic access methods have been proposed for supporting such queries. Almost all of them are designed with the primarily goal to reduce the number of page accesses, whereas our main attention is paid to decreasing the cost of in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the VLDB Endowment
سال: 2010
ISSN: 2150-8097
DOI: 10.14778/1920841.1920895